On Domains of Superior Convergence of the SSOR Method Over the SOR Method for p- Cyclic H-Matrices

نویسندگان

  • Apostolos Hadjidimos
  • Michael Neumann
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On The Exact P-Cyclic SSOR Convergence Domains

Suppose that A E (]J',n is a block p-cyclic consistently ordered matrix and let Band Sw denote , respectively, the black Jacobi and the block Symmetric Successive Overrelaxation (SSOR) iteration matrices associated with A. Neumaier a.nd Varga found (in the (p(IBI),w)-plane) the exact convergence and divergence domains of the SSOR method for the class of H-matrice8. Hadjidimos and Neumann applie...

متن کامل

Exact SOR Convergence Regions for a General Class of p-Cyclic Matrices

Linear systems whose associated block Jacobi iteration matrix B is weakly cyclic generated by the cyclic permutation u = (ul , 02,. . . , up) in the spirit of Li and Varga are considered. Regions of convergence for the corresponding block pcyclic SOR method are derived and the exact convergence domains for real spectra, u(BP), of the same sign are obtained. Moreover, analytical expressions for ...

متن کامل

On generalized SSOR-like iteration method for saddle point problems

In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: i...

متن کامل

Preconditioned SSOR Iterative Method For Linear System With M-Matrices

A preconditioned SSOR iterative method with a multi-parameters preconditioner I + S̃α is proposed. Some convergence and comparison results for αi ∈ [0, 1] are given when the coefficient matrix of linear system A is a nonsingular M−matrix. Numerical example shows that our methods are superior to the basic SSOR iterative method.

متن کامل

Two-Color Fourier Analysis of Iterative Algorithms for Elliptic Problems with Red/Black Ordering

The red/black ordering scheme is often used to increase the parallelism of iterative methods for solving elliptic partial differential equations (PDEs). However, the convergence rates are also affected, often adversely. This paper provides a unified approach, called the two-color Fourier analysis, to study the convergence rates of iterative algorithms for elliptic problems with the red/black or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013